Implementing Pstable
نویسنده
چکیده
We present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse.
منابع مشابه
Pstable Semantics for Logic Programs with Possibilistic Ordered Disjunction
In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. Moreover being closer to possibilistic inference it allows to extend the necessity-values of the clauses to be considered, causing a higher level of comparison at the moment of sel...
متن کاملPstable Tool and Its Aplication
present an implementation of pstable model semantics. Our implementation uses the well known tools: MiniSat and Lparse. Also we show the utility of an automatic demonstrator implemented with these tools for applications where the logic has consistence problems. I. INTRODUCTION The stable model semantics for logic programming support it self within the non-monotonic reasoning, [1]. This approach...
متن کاملPStable Semantics for Possibilistic Logic Programs
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...
متن کاملExpressing the Stable Semantics in Terms of the Pstable Semantics
We show that with a simple translation for normal programs, we can use the pstable model semantics to get the stable models of a normal program. We present the formal proof of this statement.
متن کاملInferring preferred extensions by Pstable semantics
When Dung introduced his argumentation approach, he proved that it can be regarded as a special form of logic programming with negation as failure. In fact, he showed that the grounded and stable semantics can be characterized by the well-founded and stable model semantics respectively. However, Dung did not give any characterization of the preferred semantics in terms of logic programming sema...
متن کامل